Efficient Algorithms for Testing the Twins Property
نویسندگان
چکیده
Weighted automata and transducers are powerful devices used in many large-scale applications. The efficiency of these applications is substantially increased when the automata or transducers used are deterministic. There exists a general determinization algorithm for weighted automata and transducers that is an extension of the classical subset construction used in the case of unweighted finite automata [14]. However, not all finite-state transducers or weighted automata and transducers can be determinized using that algorithm, thus the question of the determinizability in that sense is essential. There exists a characterization of the determinizability of functional finite-state transducers and that of unambiguous weighted automata over the tropical semiring based on a general twins property. In the case of finite-state transducers, we give an efficient algorithm for testing functionality in time O(|Q| |∆|+ |E|) where Q is the set of states, E the set of transitions, and ∆ the ouput alphabet of the input transducer. We also present a new and computationally more efficient algorithm for testing the twins property whose complexity is O(|Q|(|Q| + |E|)). In the automata case, we present a new and substantially more efficient algorithm for testing the twins property for unambiguous and cycle-unambiguous weighted automata over commutative and cancellative semirings whose complexity is O(|Q| + |E|), which we conjecture to be optimal. Our experiments show our algorithms for testing the twins property to be practical with large weighted automata and transducers of several million transitions found in speech recognition applications.
منابع مشابه
An optimal pre-determinization algorithm for weighted transducers
We present a general algorithm, pre-determinization, that makes an arbitrary weighted transducer over the tropical semiring or an arbitrary unambiguous weighted transducer over a cancellative commutative semiring determinizable by inserting in it transitions labeled with special symbols. After determinization, the special symbols can be removed or replaced with -transitions. The resulting trans...
متن کاملAlgorithmic and Analysis Techniques in Property Testing
Property testing algorithms are “ultra”-efficient algorithms that decide whether a given object (e.g., a graph) has a certain property (e.g., bipartiteness), or is significantly different from any object that has the property. To this end property testing algorithms are given the ability to perform (local) queries to the input, though the decision they need to make usually concern properties wi...
متن کاملTesting Soccer League Competition Algorithm in Comparison with Ten Popular Meta-heuristic Algorithms for Sizing Optimization of Truss Structures
Recently, many meta-heuristic algorithms are proposed for optimization of various problems. Some of them originally are presented for continuous optimization problems and some others are just applicable for discrete ones. In the literature, sizing optimization of truss structures is one of the discrete optimization problems which is solved by many meta-heuristic algorithms. In this paper, in or...
متن کاملProperty Testing in Computational Geometry
We consider the notion of property testing as applied to computational geometry. We aim at developing efficient algorithms which determine whether a given (geometrical) object has a predetermined property Q or is “far” from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the obj...
متن کاملProperty Testing in Computational Geometry ? ( Extended
We consider the notion of property testing as applied to computational geometry. We aim at developing efficient algorithms which determine whether a given (geometrical) object has a predetermined property Q or is “far” from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the obj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Automata, Languages and Combinatorics
دوره 8 شماره
صفحات -
تاریخ انتشار 2003